Degrees in $k$-minimal label random recursive trees
نویسنده
چکیده مقاله:
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
منابع مشابه
Branches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملbranches in random recursive k-ary trees
in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملLimit distribution of the degrees in scaled attachment random recursive trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node $i$ is attached to the node labeled $lfloor iX_i floor$ where $X_0$, $ldots$ , $X_n$ is a sequence of i.i.d. random variables, with support in [0,...
متن کاملHigh Degrees of Random Recursive Trees
For n ≥ 1, let Tn be a random recursive tree (RRT) on the vertex set [n] = {1, . . . , n}. Let degTn (v) be the degree of vertex v in Tn, that is, the number of children of v in Tn. Devroye and Lu [6] showed that the maximum degree ∆n of Tn satisfies ∆n/⌊log2 n⌋ → 1 almost surely; Goh and Schmutz [7] showed distributional convergence of ∆n − ⌊log2 n⌋ along suitable subsequences. In this work we...
متن کاملLimit Distribution of Degrees in Scaled Attachment Random Recursive Trees
We study the limiting distribution of the degree of a given node in a scaled attachment random recursive tree, a generalized random recursive tree, which is introduced by Devroye et. al (2011). In a scaled attachment random recursive tree, every node i is attached to the node labeled biXic where X0, . . . , Xn is a sequence of i.i.d. random variables, with support in [0, 1) and distribution fun...
متن کاملHigh degrees in recursive trees
Let Tn be a random recursive tree with vertex set [n] := {1, . . . , n} and edges directed towards the root. Let degn(i) denote the number of children of vertex i ∈ [n] of Tn. Devroye and Lu [1] showed that the maximum degree ∆n of Tn satisfies ∆n/ log2 n→ 1 a.s. Here we study the distribution of the maximum degree and of the number of vertices with near-maximum degree. For any d ∈ Z, let X d =...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 19 شماره 1
صفحات 35- 38
تاریخ انتشار 2014-06
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023